Packing Directed Circuits
نویسندگان
چکیده
We prove a conjecture of Younger, that for every integer n ≥ 0 there exists an integer t ≥ 0 such that for every digraph G, either G has n vertex-disjoint directed circuits, or G can be made acyclic by deleting at most t vertices.
منابع مشابه
Packing Directed Circuits through Prescribed Vertices Bounded Fractionally
A seminal result of Reed, Robertson, Seymour, and Thomas says that a directed graph has either k vertex-disjoint directed circuits or a set of at most f(k) vertices meeting all directed circuits. This paper aims at generalizing their result to packing directed circuits through prescribed vertices. Even, Naor, Schieber, and Sudan showed a fractional version of packing such circuits. In this pape...
متن کاملPacking directed circuits exactly
Graphs and digraphs in this paper may have loops and multiple edges. Paths and circuits have no “repeated” vertices, and in digraphs they are directed. A transversal in a digraph D is a set of vertices T which intersects every circuit, i.e. DnT is acyclic. A packing of circuits (or packing for short) is a collection of pairwise (vertex-)disjoint circuits. The cardinality of a minimum transversa...
متن کاملAdaptive cluster growth: a new algorithm for circuit placement in rectilinear regions
A new algorithm called adaptive cluster growth (ACG) for circuit packing (or detailed placement) in any rectilinear region is described; it is an analogy to the growth of a low-stress crystal in a cavity of any given shape. The algorithm ACG is suitable for the packing of circuit modules, either standard-cell or macrocell, in a rectilinear region by the refinement of a result of global placemen...
متن کاملPacking Circuits into K
We shall pack circuits of arbitrary lengths into the complete graph KN . More precisely, if N is odd and ∑t i=1 mi = (N 2 ) , mi ≥ 3, then the edges of KN can be written as an edge disjoint union of circuits of lengths m1, . . . , mt. Since the degrees of the vertices in any such packing must be even, this result cannot hold for even N . For N even, we prove that if ∑t i=1 mi ≤ (N 2 )− N 2 then...
متن کاملThe Cycling Property for the Clutter of Odd st-Walks
A binary clutter is cycling if its packing and covering linear program have integral optimal solutions for all Eulerian edge capacities. We prove that the clutter of odd stwalks of a signed graph is cycling if and only if it does not contain as a minor the clutter of odd circuits of K5 nor the clutter of lines of the Fano matroid. Corollaries of this result include, of many, the characterizatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorica
دوره 16 شماره
صفحات -
تاریخ انتشار 1996